Path Separability of Graphs
نویسندگان
چکیده
In this paper we investigate the structural properties of k-path separable graphs, that are the graphs that can be separated by a set of k shortest paths. We identify several graph families having such path separability, and we show that this property is closed under minor taking. In particular we establish a list of forbidden minors for 1-path separable graphs.
منابع مشابه
On the Path Separability of Planar Graphs
It is known that every weighted planar graph with n vertices contains three shortest paths whose removal halves the graph into connected components of at most n/2 vertices. Whether this property remains true with the use of two shortest paths only is an open problem. We show that two shortest paths are enough for a large family of planar graphs, called face-separable, composed of graphs for whi...
متن کاملSeparability of Density Matrices of Graphs for Multipartite Systems
We investigate separability of Laplacian matrices of graphs when seen as density matrices. This is a family of quantum states with many combinatorial properties. We firstly show that the well-known matrix realignment criterion can be used to test separability of this type of quantum states. The criterion can be interpreted as novel graph-theoretic idea. Then, we prove that the density matrix of...
متن کاملSeparability Generalizes Dirac's Theorem
In our study of the extremities of a graph, we define a moplex as a maximal clique module the neighborhood of which is a minimal separator of the graph. This notion enables us to strengthen Dirac’s theorem (Dirac, 1961): ‘‘Every non-clique triangulated graph has at least two non-adjacent simplicial vertices’’, restricting the definition of a simplicial vertex; this also enables us to strengthen...
متن کاملDetour Monophonic Graphoidal Covering Number of Corona Product Graph of Some Standard Graphs with the Wheel
A chord of a path $P$ is an edge joining two non-adjacent vertices of $P$. A path $P$ is called a monophonic path if it is a chordless path. A longest $x-y$ monophonic path is called an $x-y$ detour monophonic path. A detour monophonic graphoidal cover of a graph $G$ is a collection $psi_{dm}$ of detour monophonic paths in $G$ such that every vertex of $G$ is an internal vertex of at most on...
متن کاملConditions for separability in generalized Laplacian matrices and nonnegative matrices as density matrices
Recently, Laplacian matrices of graphs are studied as density matrices in quantum mechanics. We continue this study and give conditions for separability of generalized Laplacian matrices of weighted graphs with unit trace. In particular, we show that the Peres-Horodecki positive partial transpose separability condition is necessary and sufficient for separability in C2 ⊗ C. In addition, we pres...
متن کامل